An explicit lower bound for the block complexity of an algebraic number
نویسنده
چکیده
Let b ≥ 2 be an integer and ξ be an irrational real number. Among other results, we establish an explicit lower bound for the number of distinct blocks of n digits occurring in the b-ary expansion of ξ.
منابع مشابه
New Fixed Point Attacks on GOST2 Block Cipher
GOST block cipher designed in the 1970s and published in 1989 as the Soviet and Russian standard GOST 28147-89. In order to enhance the security of GOST block cipher after proposing various attacks on it, designers published a modified version of GOST, namely GOST2, in 2015 which has a new key schedule and explicit choice for S-boxes. In this paper, by using three exactly identical portions of ...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملA Quadratic Lower Bound for Homogeneous Algebraic Branching Programs
An algebraic branching program (ABP) is a directed acyclic graph, with a start vertex s, and end vertex t and each edge having a weight which is an affine form in F[x1, x2, . . . , xn]. An ABP computes a polynomial in a natural way, as the sum of weights of all paths from s to t, where the weight of a path is the product of the weights of the edges in the path. An ABP is said to be homogeneous ...
متن کاملALGEBRAIC NONLINEARITY IN VOLTERRA-HAMMERSTEIN EQUATIONS
Here a posteriori error estimate for the numerical solution of nonlinear Voltena- Hammerstein equations is given. We present an error upper bound for nonlinear Voltena-Hammastein integral equations, in which the form of nonlinearity is algebraic and develop a posteriori error estimate for the recently proposed method of Brunner for these problems (the implicitly linear collocation method)...
متن کاملRemarks on Graph Complexity
We revisit the notion of graph complexity introduced by Pudll ak, RR odl, and Savick y PRS]. Using their framework, we show that suuciently strong superlinear monotone lower bounds for the very special class of 2-slice functions would imply superpolynomial lower bounds for some other functions. Given an n-vertex graph G, the corresponding 2-slice function fG on n variables evaluates to zero on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008